Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms

We consider the problem of community detection in the Stochastic Block Model with a finite number K of communities of sizes linearly growing with the network size n. This model consists in a random graph such that each pair of vertices is connected independently with probability p within communities and q across communities. One observes a realization of this random graph, and the objective is to reconstruct the communities from this observation. We show that under spectral algorithms, the number of misclassified vertices does not exceed s with high probability as n grows large, whenever pn = ω(1), s = o(n) and lim inf n→∞ n(α1p+ α2q − (α1 + α2)p 1 α1+α2 q 2 α1+α2 ) log(n s ) > 1, (1) whereα1 and α2 denote the (fixed) proportions of vertices in the two smallest communities. In view of recent work by Abbe et al. (2014) and Mossel et al. (2014), this establishes that the proposed spectral algorithms are able to exactly recover communities whenever this is at all possible in the case of networks with two communities with equal sizes. We conjecture that condition (1) is actually necessary to obtain less than s misclassified vertices asymptotically, which would establish the optimality of spectral method in more general scenarios.